0.13/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.14 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.14/0.36 % Computer : n031.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1200 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Jul 13 12:20:14 EDT 2021 0.14/0.36 % CPUTime : 0.14/0.36 % Number of cores: 8 0.14/0.36 % Python version: Python 3.6.8 0.14/0.36 # Version: 2.6rc1-ho 0.14/0.36 # No SInE strategy applied 0.14/0.36 # Trying AutoSched0 for 59 seconds 0.14/0.40 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y 0.14/0.40 # and selection function SelectMaxLComplexAvoidPosPred. 0.14/0.40 # 0.14/0.40 # Preprocessing time : 0.028 s 0.14/0.40 0.14/0.40 # Proof found! 0.14/0.40 # SZS status Theorem 0.14/0.40 # SZS output start CNFRefutation 0.14/0.40 thf(satz44, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X1 @ X2=>((moref @ X3 @ X4<=eq @ X2 @ X4)<=eq @ X1 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz44)). 0.14/0.40 thf(satz56, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(eq @ X1 @ X2=>(eq @ (pf @ X1 @ X3) @ (pf @ X2 @ X4)<=eq @ X3 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz56)). 0.14/0.40 thf(satz61, axiom, ![X1:frac, X2:frac, X3:frac]:(moref @ X1 @ X2=>moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz61)). 0.14/0.40 thf(satz37, axiom, ![X1:frac]:eq @ X1 @ X1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz37)). 0.14/0.40 thf(n, axiom, (~(moref @ z @ u)=>eq @ z @ u), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', n)). 0.14/0.40 thf(satz65b, conjecture, moref @ (pf @ x @ z) @ (pf @ y @ u), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz65b)). 0.14/0.40 thf(satz64, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X1 @ X2=>(moref @ X3 @ X4=>moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz64)). 0.14/0.40 thf(m, axiom, moref @ x @ y, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m)). 0.14/0.40 thf(c_0_8, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X1 @ X2=>(eq @ X1 @ X3=>(eq @ X2 @ X4=>moref @ X3 @ X4))), inference(fof_simplification,[status(thm)],[satz44])). 0.14/0.40 thf(c_0_9, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(eq @ X1 @ X2=>(eq @ X3 @ X4=>eq @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))), inference(fof_simplification,[status(thm)],[satz56])). 0.14/0.40 thf(c_0_10, plain, ![X28:frac, X29:frac, X30:frac, X31:frac]:(~moref @ X28 @ X29|(~eq @ X28 @ X30|(~eq @ X29 @ X31|moref @ X30 @ X31))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])). 0.14/0.40 thf(c_0_11, plain, ![X35:frac, X36:frac, X37:frac, X38:frac]:(~eq @ X35 @ X36|(~eq @ X37 @ X38|eq @ (pf @ X35 @ X37) @ (pf @ X36 @ X38))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])). 0.14/0.40 thf(c_0_12, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ X3 @ X4|~moref @ X1 @ X2|~eq @ X1 @ X3|~eq @ X2 @ X4), inference(split_conjunct,[status(thm)],[c_0_10])). 0.14/0.40 thf(c_0_13, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(eq @ (pf @ X1 @ X3) @ (pf @ X2 @ X4)|~eq @ X1 @ X2|~eq @ X3 @ X4), inference(split_conjunct,[status(thm)],[c_0_11])). 0.14/0.40 thf(c_0_14, plain, ![X32:frac, X33:frac, X34:frac]:(~moref @ X32 @ X33|moref @ (pf @ X32 @ X34) @ (pf @ X33 @ X34)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz61])])). 0.14/0.40 thf(c_0_15, plain, ![X1:frac, X4:frac, X7:frac, X6:frac, X3:frac, X2:frac]:(moref @ X1 @ (pf @ X2 @ X3)|~moref @ X4 @ (pf @ X6 @ X7)|~eq @ X4 @ X1|~eq @ X7 @ X3|~eq @ X6 @ X2), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.14/0.40 thf(c_0_16, plain, ![X1:frac, X3:frac, X2:frac]:(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)|~moref @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_14])). 0.14/0.40 thf(c_0_17, plain, ![X23:frac]:eq @ X23 @ X23, inference(variable_rename,[status(thm)],[satz37])). 0.14/0.40 thf(c_0_18, plain, (~moref @ z @ u=>eq @ z @ u), inference(fof_simplification,[status(thm)],[n])). 0.14/0.40 thf(c_0_19, negated_conjecture, ~moref @ (pf @ x @ z) @ (pf @ y @ u), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz65b])])). 0.14/0.40 thf(c_0_20, plain, ![X24:frac, X25:frac, X26:frac, X27:frac]:(~moref @ X24 @ X25|(~moref @ X26 @ X27|moref @ (pf @ X24 @ X26) @ (pf @ X25 @ X27))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz64])])). 0.14/0.40 thf(c_0_21, plain, ![X1:frac, X3:frac, X2:frac, X4:frac, X6:frac, X7:frac]:(moref @ X1 @ (pf @ X2 @ X3)|~eq @ (pf @ X4 @ X6) @ X1|~eq @ X6 @ X3|~eq @ X7 @ X2|~moref @ X4 @ X7), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.14/0.40 thf(c_0_22, plain, ![X1:frac]:eq @ X1 @ X1, inference(split_conjunct,[status(thm)],[c_0_17])). 0.14/0.40 thf(c_0_23, plain, (moref @ z @ u|eq @ z @ u), inference(fof_nnf,[status(thm)],[c_0_18])). 0.14/0.40 thf(c_0_24, negated_conjecture, ~moref @ (pf @ x @ z) @ (pf @ y @ u), inference(split_conjunct,[status(thm)],[c_0_19])). 0.14/0.40 thf(c_0_25, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4)|~moref @ X1 @ X2|~moref @ X3 @ X4), inference(split_conjunct,[status(thm)],[c_0_20])). 0.14/0.40 thf(c_0_26, plain, moref @ x @ y, inference(split_conjunct,[status(thm)],[m])). 0.14/0.40 thf(c_0_27, plain, ![X1:frac, X3:frac, X4:frac, X2:frac, X6:frac]:(moref @ (pf @ X1 @ X2) @ (pf @ X3 @ X4)|~eq @ X2 @ X4|~eq @ X6 @ X3|~moref @ X1 @ X6), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.14/0.40 thf(c_0_28, plain, (moref @ z @ u|eq @ z @ u), inference(split_conjunct,[status(thm)],[c_0_23])). 0.14/0.40 thf(c_0_29, negated_conjecture, ~moref @ z @ u, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])])). 0.14/0.40 thf(c_0_30, plain, ![X2:frac, X1:frac, X4:frac, X3:frac]:(moref @ (pf @ X1 @ X2) @ (pf @ X3 @ X4)|~eq @ X2 @ X4|~moref @ X1 @ X3), inference(spm,[status(thm)],[c_0_27, c_0_22])). 0.14/0.40 thf(c_0_31, plain, eq @ z @ u, inference(sr,[status(thm)],[c_0_28, c_0_29])). 0.14/0.40 thf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_30]), c_0_31]), c_0_26])]), ['proof']). 0.14/0.40 # SZS output end CNFRefutation 0.14/0.40 # Proof object total steps : 33 0.14/0.40 # Proof object clause steps : 15 0.14/0.40 # Proof object formula steps : 18 0.14/0.40 # Proof object conjectures : 5 0.14/0.40 # Proof object clause conjectures : 3 0.14/0.40 # Proof object formula conjectures : 2 0.14/0.40 # Proof object initial clauses used : 8 0.14/0.40 # Proof object initial formulas used : 8 0.14/0.40 # Proof object generating inferences : 6 0.14/0.40 # Proof object simplifying inferences : 6 0.14/0.40 # Training examples: 0 positive, 0 negative 0.14/0.40 # Parsed axioms : 17 0.14/0.40 # Removed by relevancy pruning/SinE : 0 0.14/0.40 # Initial clauses : 17 0.14/0.40 # Removed in clause preprocessing : 9 0.14/0.40 # Initial clauses in saturation : 8 0.14/0.40 # Processed clauses : 81 0.14/0.40 # ...of these trivial : 0 0.14/0.40 # ...subsumed : 17 0.14/0.40 # ...remaining for further processing : 64 0.14/0.40 # Other redundant clauses eliminated : 0 0.14/0.40 # Clauses deleted for lack of memory : 0 0.14/0.40 # Backward-subsumed : 0 0.14/0.40 # Backward-rewritten : 0 0.14/0.40 # Generated clauses : 134 0.14/0.40 # ...of the previous two non-trivial : 132 0.14/0.40 # Contextual simplify-reflections : 0 0.14/0.40 # Paramodulations : 133 0.14/0.40 # Factorizations : 0 0.14/0.40 # NegExts : 0 0.14/0.40 # Equation resolutions : 0 0.14/0.40 # Propositional unsat checks : 0 0.14/0.40 # Propositional check models : 0 0.14/0.40 # Propositional check unsatisfiable : 0 0.14/0.40 # Propositional clauses : 0 0.14/0.40 # Propositional clauses after purity: 0 0.14/0.40 # Propositional unsat core size : 0 0.14/0.40 # Propositional preprocessing time : 0.000 0.14/0.40 # Propositional encoding time : 0.000 0.14/0.40 # Propositional solver time : 0.000 0.14/0.40 # Success case prop preproc time : 0.000 0.14/0.40 # Success case prop encoding time : 0.000 0.14/0.40 # Success case prop solver time : 0.000 0.14/0.40 # Current number of processed clauses : 63 0.14/0.40 # Positive orientable unit clauses : 3 0.14/0.40 # Positive unorientable unit clauses: 0 0.14/0.40 # Negative unit clauses : 4 0.14/0.40 # Non-unit-clauses : 56 0.14/0.40 # Current number of unprocessed clauses: 55 0.14/0.40 # ...number of literals in the above : 348 0.14/0.40 # Current number of archived formulas : 0 0.14/0.40 # Current number of archived clauses : 1 0.14/0.40 # Clause-clause subsumption calls (NU) : 1687 0.14/0.40 # Rec. Clause-clause subsumption calls : 1071 0.14/0.40 # Non-unit clause-clause subsumptions : 8 0.14/0.40 # Unit Clause-clause subsumption calls : 6 0.14/0.40 # Rewrite failures with RHS unbound : 0 0.14/0.40 # BW rewrite match attempts : 1 0.14/0.40 # BW rewrite match successes : 0 0.14/0.40 # Condensation attempts : 0 0.14/0.40 # Condensation successes : 0 0.14/0.40 # Termbank termtop insertions : 3744 0.14/0.40 0.14/0.40 # ------------------------------------------------- 0.14/0.40 # User time : 0.038 s 0.14/0.40 # System time : 0.002 s 0.14/0.40 # Total time : 0.040 s 0.14/0.40 # Maximum resident set size: 1656 pages 0.14/0.40 EOF